Group and Moore-Penrose inverses of regular morphisms with kernel and cokernel

Binary Moore-Penrose Inverses of Set Inclusion Incidence Matrices

This note is a supplement to some recent work of R.B. Bapat on Moore-Penrose inverses of set inclusion matrices. Among other things Bapat constructs these inverses (in case of existence) forH(s, k) mod p, p an arbitrary prime, 0 ≤ s ≤ k ≤ v − s. Here we restrict ourselves to p = 2. We give conditions for s, k which are easy to state and which ensure that the Moore-Penrose inverse of H(s, k) mod...

On Nonnegative Moore-Penrose Inverses of Perturbed Matrices

We consider the problem of characterizing nonnegativity of the Moore-Penrose inverse for matrix perturbations of the type A − XGY, when the Moore-Penrose inverse of A is nonnegative. Here, we say that a matrix B = (b ij ) is nonnegative and denote it by B ≥ 0 if b ij ≥ 0, ∀i, j. This problemwasmotivated by the results in [1], where the authors consider an M-matrix A and find sufficient conditio...

A note on stable perturbations of Moore-Penrose inverses

SUMMARY Perturbation bounds for Moore-Penrose inverses of rectangular matrices play a significant role in the perturbation analysis for linear least squares problems. In this note, we derive a sharp upper bound for Moore-Penrose inverses, which is better than a well known existing one [12].

Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration

We modify the algorithm of [1], based on Newton’s iteration and on the concept of 2-displacement rank, to the computation of the Moore-Penrose inverse of a rank-deficient Toeplitz matrix. Numerical results are presented to illustrate the effectiveness of the method.

Computing Moore-Penrose Inverses of Ore Polynomial Matrices